Parallel Sequential Searching Algorithm for Unsorted Array
نویسندگان
چکیده
منابع مشابه
Incremental Construction of Minimal Acyclic Sequential Transducers from Unsorted Data
This paper presents an efficient algorithm for the incremental construction of a minimal acyclic sequential transducer (ST) for a dictionary consisting of a list of input and output strings. The algorithm generalises a known method of constructing minimal finite-state automata (Daciuk et al., 2000). Unlike the algorithm published by Mihov and Maurel (2001), it does not require the input strings...
متن کاملParallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded Function
In this paper we consider a parallel algorithm that detects the maximizer of unimodal function ( ) f x computable at every point on unbounded interval (0, ) . The algorithm consists of two modes: scanning and detecting. Search diagrams are introduced as a way to describe parallel searching algorithms on unbounded intervals. Dynamic programming equations, combined with a series of liner progra...
متن کاملA Novel Division Algorithm for Parallel and Sequential Processing
A new algorithm for reducing the division operation to a series of smaller divisions is introduced. Partitioning the dividend into segments, we perform divisions, shifts, and accumulations taking into account the weight of dividend bits. Each partial division can be performed by any existing division algorithm. From an algorithmic point of view, computational complexity analysis is performed in...
متن کاملParallel Algorithm for Generating Permutations on Linear Array
Given n items, a parallel algorithm for generating the n! permutations is presented. This algorithm is designed to run on a linear array consisting of n identical processing elements (PEs for short). These PEs are numbered and referred to as PE(i) for 1 < i < n. Each PE is responsible for producing one component of each permutation. Every PE(i) contains six registers, namely: C(i), T(i), K(i), ...
متن کاملParallel Shortest Path Searching Algorithm on Dynamically Reconfigurable Processor
This paper proposes a parallel shortest pathsearching algorithm and implements it on a newly structured parallel reconfigurable processor, DAPDNA-2 (IPFlex Inc). The proposed algorithm can be applied to the very large Internet network designs of the future.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Journal of Applied Sciences
سال: 2011
ISSN: 1815-932X
DOI: 10.3923/rjasci.2011.70.75